Investigating the Impact of Sequential Selection in the (1,4)-CMA-ES on the Noiseless BBOB-2010 Testbed [Black-Box Optimization Benchmarking Workshop]
نویسندگان
چکیده
This paper investigates the impact of sequential selection, a concept recently introduced for Evolution Strategies (ESs). Sequential selection performs the evaluations of the different candidate solutions sequentially and concludes the iteration immediately if one offspring is better than the parent. In this paper, the (1,4)-CMA-ES, where sequential selection is implemented, is compared on the BBOB-2010 noiseless testbed to the (1,4)-CMA-ES. For each strategy, an independent restart mechanism is implemented. A total budget of 10D function evaluations per trial has been used, where D is the dimension of the search space. The experiments show for the (1,4)-CMA-ES a statistically significant worsening compared to the (1,4)-CMA-ES only on the attractive sector function but a significant improvement by about 20% on 5 out of the 24 BBOB-2010 functions (sphere, separable and rotated ellipsoid, discus, and sum of different powers).
منابع مشابه
Benchmarking the (1,4)-CMA-ES With Mirrored Sampling and Sequential Selection on the Noiseless BBOB-2010 Testbed [Black-Box Optimization Benchmarking Workshop]
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space R. Recently, mirrored samples and sequential selection have been introduced within CMA-ES to improve its local search performances. In this paper, we benchmark the (1,4m)-CMA-ES which implements mirrored samples and sequent...
متن کاملBenchmarking the (1,4)-CMA-ES With Mirrored Sampling and Sequential Selection on the Noisy BBOB-2010 Testbed [Black-Box Optimization Benchmarking Workshop]
The Covariance-Matrix-Adaptation Evolution-Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space R. Recently, mirrored samples and sequential selection have been introduced within CMA-ES to improve its local search performances. In this paper, we benchmark the (1,4m)CMA-ES which implements mirrored samples and sequential selectio...
متن کاملBI-population CMA-ES Algorithms with Surrogate Models and Line Searches
In this paper, three extensions of the BI-population Covariance Matrix Adaptation Evolution Strategy with weighted active covariance matrix update (BIPOP-aCMA-ES) are investigated. First, to address expensive optimization, we benchmark a recently proposed extension of the self-adaptive surrogate-assisted CMA-ES which benefits from more intensive surrogate model exploitation (BIPOP-saACM-k). Sec...
متن کاملBBOB 2009: Comparison Tables of All Algorithms on All Noisy Functions
This document presents the results in the form of tables from the Black-Box Optimization Benchmarking (BBOB) workshop of the Genetic and Evolutionary Computation Conference (GECCO), Montreal Canada, 2009. Each table presents the comparative performances of the algorithms submitted to BBOB 2009 on one problem from the noisy function testbed. Key-words: continuous optimization, benchmarking Anne ...
متن کاملBlack Box Optimization Benchmarking of the GLOBAL Method
GLOBAL is a multi-start type stochastic method for bound constrained global optimization problems. Its goal is to find the best local minima that are potentially global. For this reason it involves a combination of sampling, clustering, and local search. The role of clustering is to reduce the number of local searches by forming groups of points around the local minimizers from a uniformly samp...
متن کامل